Efficient Separability of Regular Languages by Subsequences and Suffixes
نویسندگان
چکیده
When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewiseand suffix-testable languages and variants thereof. We give characterizations of when two languages can be separated and present an overview of when these problems can be decided in polynomial time if K and L are given by nondeterministic automata.
منابع مشابه
Separability by Short Subsequences and Subwords
The separability problem for regular languages asks, given two regular languages I and E, whether there exists a language S that separates the two, that is, includes I but contains nothing from E. Typically, S comes from a simple, less expressive class of languages than I and E. In general, a simple separator S can be seen as an approximation of I or as an explanation of how I and E are differe...
متن کاملKernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature space and learning a separating hyperplane in that space. Such mappings can often be represented flexibly with string kernels, with the additional benefit of computational efficiency. The paradigm inspected can thus be ...
متن کاملRegular Separability of Parikh Automata
We investigate a subclass of languages recognized by vector addition systems, namely languages of nondeterministic Parikh automata. While the regularity problem (is the language of a given automaton regular?) is undecidable for this model, we show surprising decidability of the regular separability problem: given two Parikh automata, is there a regular language that contains one of them and is ...
متن کاملDeciding Piecewise Testable Separability for Regular Tree Languages
The piecewise testable separability problem asks, given two input languages, whether there exists a piecewise testable language that contains the first input language and is disjoint from the second. We prove a general characterisation of piecewise testable separability on languages in a well-quasiorder, in terms of ideals of the ordering. This subsumes the known characterisations in the case o...
متن کاملA Note on Decidable Separability by Piecewise Testable Languages
The separability problem for languages from a class C by languages of a class S asks, for two given word languages I and E from C, whether there exists a language S from S which includes I and excludes E, that is, I ⊆ S and S ∩ E = ∅. It is known that separability for context-free languages by any class containing all definite languages (such as regular languages) is undecidable. We show that s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013